1. Class No.11 Data Structures http://ecomputernotes.com

2. Code for Simulation // print the final avaerage wait time. double avgWait = (totalTime*1.0)/count; cout << &quot;Total time: &quot; << totalTime << endl; cout << “Customer: &quot; << count << endl; cout << &quot;Average wait: &quot; << avgWait << endl; http://ecomputernotes.com

3. Priority Queue #include &quot;Event.cpp&quot; #define PQMAX 30 class PriorityQueue { public: PriorityQueue() { size = 0; rear = -1; }; ~PriorityQueue() {}; int full(void) { return ( size == PQMAX ) ? 1 : 0; }; http://ecomputernotes.com

4. Priority Queue Event* remove() { if( size > 0 ) { Event* e = nodes[0]; for(int j=0; j < size-2; j++ ) nodes[j] = nodes[j+1]; size = size-1; rear=rear-1; if( size == 0 ) rear = -1; return e; } return (Event*)NULL; cout << &quot;remove - queue is empty.&quot; << endl; }; http://ecomputernotes.com

5. Priority Queue int insert(Event* e) { if( !full() ) { rear = rear+1; nodes[rear] = e; size = size + 1; sortElements(); // in ascending order return 1; } cout << &quot;insert queue is full.&quot; << endl; return 0; }; int length() { return size; }; }; http://ecomputernotes.com

10. Binary Tree A B D H C E F G I Left subtree root Right subtree http://ecomputernotes.com

19. Binary Tree: Terminology A B D H C E F G I parent Left descendant Right descendant Leaf nodes Leaf nodes http://ecomputernotes.com

22. Level of a Binary Tree Node A B D H C E F G I 1 0 1 2 2 2 3 3 3 Level 0 Level 1 Level 2 Level 3 http://ecomputernotes.com

24. Complete Binary Tree A B Level 0: 2 0 nodes H D I E J K C L F M G N O Level 1: 2 1 nodes Level 2: 2 2 nodes Level 3: 2 3 nodes http://ecomputernotes.com